Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results
نویسندگان
چکیده
We show the following new lowness results for the probabilistic class ZPP NP. The class AM \ coAM is low for ZPP NP. As a consequence it follows that Graph Iso-morphism and several group-theoretic problems known to be in AM \ coAM are low for ZPP NP. The class IPPP/poly], consisting of sets that have interactive proof systems with honest provers in P/poly are also low for ZPP NP. We consider lowness properties of nonuniform function classes: NPMV/poly, NPSV/poly, NPMV t /poly, and NPSV t /poly. Speciically, we show that Sets whose characteristic functions are in NPSV/poly and that have program checkers (in the sense of Blum and Kannan 8]) are low for AM and ZPP NP. Sets whose characteristic functions are in NPMV t /poly are low for p 2 .
منابع مشابه
On pseudorandomness and resource-bounded measure
In this paper we extend a key result of Nisan and Wigderson NW94] to the nondeterministic setting: for all > 0 we show that if there is a language in E = DTIME(2 O(n)) that is hard to approximate by nondeterministic circuits of size 2 n , then there is a pseudorandom generator that can be used to derandomize BP NP (in symbols, BP NP = NP). By applying this extension we are able to answer some o...
متن کاملGraph Isomorphism and Circuit Size
We show that the Graph Automorphism problem is ZPP-reducible to MKTP, the problem of minimizing time-bounded Kolmogorov complexity. MKTP has previously been studied in connection with the Minimum Circuit Size Problem (MCSP) and is often viewed as essentially a different encoding of MCSP. All prior reductions to MCSP have applied equally well to MKTP, and vice-versa, and all such reductions have...
متن کاملGraph Isomorphism is in the Low Hierarchy
The problem of determining whether two given finite graphs are isomorphic is easily seen to belong to the class NP. But up to now, no polynomial time algorithm is known. On the other hand, no NP-completeness proof is known either. That is, GRAPH ISOMORPHISM is one of the few “open problems” in NP according to Garey and Johnson’s terminology [9]. Note that GRAPH ISOMORPHISM is already mentioned ...
متن کاملDegrees that Are Low for Isomorphism
We say that a degree is low for isomorphism if, whenever it can compute an isomorphism between a pair of computable structures, there is already a computable isomorphism between them. We show that while there is no clear-cut relationship between this property and other properties related to computational weakness, the low-forisomorphism degrees contain all Cohen 2-generics and are disjoint from...
متن کاملThe Complexity of Minimizing FBDDs
Free Binary Decision Diagrams (FBDDs) are a data structure for the representation and manipulation of Boolean functions. Efficient algorithms for most of the important operations are known if only FBDDs respecting a fixed graph ordering are considered. However, the size of such an FBDD may strongly depend on the chosen graph ordering and efficient algorithms for computing good or optimal graph ...
متن کامل